package NC68_跳台阶;

public class Solution {
    public int jumpFloor(int target) {
        if (target == 0 || target == 1){
            return 1;
        }
        int num1 = 1;
        int num2 = 1;
        int num3 = 0;
        for (int i = 2; i <= target; i++){
            num3 = num1 + num2;
            num1 = num2;
            num2 = num3;
        }
        return num3;
    }
}
